The arity gap of order-preserving functions and extensions of pseudo-Boolean functions
نویسندگان
چکیده
The aim of this paper is to classify order-preserving functions according to their arity gap. Noteworthy examples of order-preserving functions are the so-called aggregation functions.We first explicitly classify the Lovász extensions of pseudo-Boolean functions according to their arity gap. Then we consider the class of order-preserving functions between partially ordered sets, and establish a similar explicit classification for this function class. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
The Arity Gap of Aggregation Functions and Further Extensions
The aim of this paper is to completely classify all aggregation functions based on the notion of arity gap. We first establish explicit descriptions of the arity gap of the Lovász extensions of pseudo-Boolean functions and, in particular, of the Choquet integrals. Then we consider the wider class of order-preserving functions between arbitrary, possibly different, posets, and show that similar ...
متن کاملOn the Arity Gap of Finite Functions: Results and Applications
Let A be a finite set and B an arbitrary set with at least two elements. The arity gap of a function f : An → B is the minimum decrease in the number of essential variables when essential variables of f are identified. A non-trivial fact is that the arity gap of such B-valued functions on A is at most |A|. Even less trivial to verify is the fact that the arity gap of B-valued functions on A wit...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملGeneralizations of Swierczkowski's lemma and the arity gap of finite functions
Świerczkowski’s lemma—as it is usually formulated—asserts that if f : An → A is an operation on a finite set A, n ≥ 4, and every operation obtained from f by identifying a pair of variables is a projection, then f is a semiprojection. We generalize this lemma in various ways. First, it is extended to B-valued functions on A instead of operations on A and to essentially at most unary functions i...
متن کاملEssential arity gap of Boolean functions
In this paper we investigate the Boolean functions with essential arity gap 2. We use Full Conjunctive Normal Forms instead of Zhegalkin’s polynomials, which allow us to simplify the proofs and to obtain several combinatorial results, concerning the Boolean functions with a given arity gap.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 160 شماره
صفحات -
تاریخ انتشار 2012